A Constraint Based System for Lexical
نویسنده
چکیده
This paper is concerned with the lexical knowledge retrieval system created at the Linguistic Modelling Laboratory. The main goal of the system is to provide a powerful and comfortable interface for lexical knowledge retrieval from large morphological dictionary. To achieve this a constraint based approach is applied that leads to a very eeective algorithm. The algorithm for query building, which is also used for retrieving of general grammatical knowledge, is presented in details. In our opinion this method is very suitable for knowledge retrieval in domains with complex and irregular classiications.
منابع مشابه
A Hybrid Machine Translation System Based on a Monotone Decoder
In this paper, a hybrid Machine Translation (MT) system is proposed by combining the result of a rule-based machine translation (RBMT) system with a statistical approach. The RBMT uses a set of linguistic rules for translation, which leads to better translation results in terms of word ordering and syntactic structure. On the other hand, SMT works better in lexical choice. Therefore, in our sys...
متن کاملA New Model for Lexical Choice for Open-Class Words
The lexical choice process should be regarded as a constraint satisfaction problem: the generation system must choose a lexical unit that is accurate (t~mthful), va//d (conveys the necessary information), and preferred (maxirnal under a preference function). This corts~aint-based architecture allows a clema separation to be made between what the system knows of the object or event, and what the...
متن کاملLexical Rules In Constraint-Based Grammars
Lexical rules have been used to cover a very diverse range of phenomena in constraint-based grammars. Examination of the full range of rules proposed shows that Carpenter’s (1991) postulated upper bound on the length of list-valued attributes such as subcat in the lexicon cannot be maintained, leading to unrestricted generative capacity in constraint-based formalisms utilizing HPSG-style lexica...
متن کاملValence Alternation without Lexical Rules
Valence changing lexical rules are a problematic component of constraint-based grammar formalisms. Lexical rules of this type are procedural, require defaults, and may easily lead to spurious ambiguity. Relational constraints can be used to eliminate such rules. The relational approach does not require defaults, is declarative, avoids spurious ambiguity, and can be an integrated part of a hiera...
متن کاملSTRUCTURAL SYSTEM RELIABILITY-BASED OPTIMIZATION OF TRUSS STRUCTURES USING GENETIC ALGORITHM
Structural reliability theory allows structural engineers to take the random nature of structural parameters into account in the analysis and design of structures. The aim of this research is to develop a logical framework for system reliability analysis of truss structures and simultaneous size and geometry optimization of truss structures subjected to structural system reliability constraint....
متن کامل